A Multiplication Technique for the Factorization of Bivariate Quaternionic Polynomials
نویسندگان
چکیده
Abstract We consider bivariate polynomials over the skew field of quaternions, where indeterminates commute with all coefficients and each other. analyze existence univariate factorizations, that is, factorizations linear factors. A necessary condition for is factorization norm polynomial into a product polynomials. This however, not sufficient. Our central result states exist after multiplication suitable real as long fulfilled. present an algorithm computing this corresponding factorization. If original exists, input produces constant factor, thus giving posteriori factorizations. Some obtained in way are interest mechanism science. example curious closed-loop eight revolute joints.
منابع مشابه
An Algorithm for Approximate Factorization of Bivariate Polynomials
In this paper, we propose a new numerical method for factoring approximate bivariate polynomials over C. The method relies on Ruppert matrix and singular value decomposition. We also design a new reliable way to compute the approximate GCD of bivariate polynomials with floating-point coefficients. The algorithm has been implemented in Maple 9. The experiments show that the algorithms are very e...
متن کاملNormalization of Quaternionic Polynomials
Quaternionic polynomials are generated by quaternionic variables and the quaternionic product. This paper proposes the generating ideal of quaternionic polynomials in tensor algebra, finds the Gröbner base of the ideal in the case of pure imaginary quaternionic variables, and describes the normal forms of such quaternionic polynomials explicitly.
متن کاملAlgebraic adjoint of the polynomials-polynomial matrix multiplication
This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
Bivariate Polynomial Multiplication
Inspired by the discussion in [5], we study the multiplicative complexity and the rank of the multiplication in the local algebras Rm;n = k[x; y]=(xm+1; yn+1) and Tn = k[x; y]=(xn+1; xny; : : : ; yn+1) of bivariate polynomials. We obtain the lower bounds (2 13 o(1)) dimRm;n and (2 12 o(1)) dim Tn for the multiplicative complexity of the multiplication in Rm;n and Tn, respectively. On the other ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Clifford Algebras
سال: 2021
ISSN: ['0188-7009', '1661-4909']
DOI: https://doi.org/10.1007/s00006-021-01194-9